A Lower Bound for Hellbronn's Triangle Problem in d Dimensions
نویسنده
چکیده
In this paper we show a lower bound for the generalization of Heilbronn’s triangle problem to d dimensions; namely, we show that there exists a set S of n points in the d-dimensional unit cube so that every d + 1 points of S define a simplex of volume Ω( 1 nd ). We also show a constructive incremental positioning of n points in a unit 3-cube for which every tetrahedron defined by four of these points has volume Ω( 1 n4 ).
منابع مشابه
A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
متن کاملINFORMATION BOUNDS ARE WEAK IN THE SHORTEST DISTANCE PROBLEM by Ronald
In the all-pair shortest distance problem, one computes the matrix D = (dij) where d. . iJ is the minimum weighted length of any path from vertex i to vertex j in a directed complete graph with a weight on each edge. In all the known algorithms, a shortest path p.. 13 achieving dij is also implicitly computed. In fact, log3 f(n) is an informationtheoretic lower bound where f(n) is the total num...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملA new method for 3-D magnetic data inversion with physical bound
Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...
متن کامل-
This paper is concerned with the problem of finding a lower bound for certain matrix operators such as Hausdorff and Hilbert matrices on sequence spaces lp(w) and Lorentz sequence spaces d(w,p), which is recently considered in [7,8], similar to [13] considered by J. Pecaric, I. Peric and R. Roki. Also, this study is an extension of some works which are studied before in [1,2,7,8].
متن کامل